منابع مشابه
Access to Legal Documents: Exact Match, Best Match, and Combinations
In this paper, we document our efforts in participating to the TREC 2007 Legal track. We had multiple aims: First, to experiment with using different query formulations, trying to exploit the verbose topic statements. Second, to analyse how ranked retrieval methods can be fruitfully combined with traditional Boolean queries. Our main findings can be summarized as follows: First, we got mixed re...
متن کاملBest-Match Retrieval for Structured Images
|This paper propose a new methodology for fast best-match retrieval of structured images. A triangle inequality property for the tree-distance introduced by O azer [IEEE Transactions on P.A.M.I., Vol. 19, No. 12, December 1997] is proved. This property is in turn applied to obtain a saturation algorithm of the trie used to store the database of the collection of pictures. The new approach can b...
متن کاملExploiting Best-Match Equations for Efficient Reinforcement Learning
This article presents and evaluates best-match learning, a new approach to reinforcement learning that trades off the sample efficiency of model-based methods with the space efficiency of modelfree methods. Best-match learning works by approximating the solution to a set of best-match equations, which combine a sparse model with a model-free Q-value function constructed from samples not used by...
متن کاملFast Best-Match Shape Searching in Rotation Invariant Metric Spaces
The matching of two-dimensional shapes is an important problem with applications in domains as diverse as biometrics, industry, medicine and zoology. The distance measure used must be invariant to many distortions, including scale, offset, noise, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure...
متن کاملA Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation
To improve tit(.' coverage of examl)le-bases , two nlethods are introduced into the 1)est-match algor i thm. The first is for acquiring conjunctive relat ionships fl'om corpora, as measures of word similarity t h a t can be used in addit ion to thesauruses. The Second, used when a word does not appear in an examltled)asc or a thesaurus, is for inferring links to words in the examph>base by ( 'm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Biology
سال: 2019
ISSN: 0303-6812,1432-1416
DOI: 10.1007/s00285-019-01332-9